Spatial and behavioral types in the pi-calculus

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial and Behavioral Types in the Pi-Calculus

We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi’s behavioural type systems, drawing benefits from both. In our approach, type systems for the pi-calculus are introduced where newly declared (restricted) names are annotated with spatial process properties, predicating on those names, that are expected to hold in the scope of the declaration. Types are ak...

متن کامل

Linearity, session types and the Pi calculus

We present a reconstruction of session types in a conventional pi calculus. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve to unrestricted channels. We equip types with a constructor that describes the two ends of a same communication channel, and prop...

متن کامل

A Linear Account of Session Types in the Pi Calculus

We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times. We equip types with a constructor that denotes the two ends of a same communication channel. In order to assess the flexibility of the new type system, we prov...

متن کامل

Toward a Modal Theory of Types for the pi-Calculus

We study the problem of specifying and verifying properties of -calculus processes while relying on a bisimulation semantics. As our property speci cation language we use a version of the modal -calculus adapted to the -calculus. We show that the logical language is su ciently expressive to characterize by means of a nite formula a process up to any approximation of the bisimulation relation. W...

متن کامل

Full Abstraction in a Subtyped pi-Calculus with Linear Types

We introduce a concise pi-calculus with directed choices and develop a theory of subtyping. Built on a simple behavioural intuition, the calculus offers exact semantic analysis of the extant notions of subtyping in functional programming languages and session-based programming languages. After illustrating the idea of subtyping through examples, we show type-directed embeddings of two known sub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2010

ISSN: 0890-5401

DOI: 10.1016/j.ic.2009.10.011